Efficient routing on scale-free networks based on local information
نویسندگان
چکیده
منابع مشابه
Efficient routing on scale-free networks based on local information
In this letter, we propose a new routing strategy with a single free parameter α only based on local information of network topology. In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of α is sought out. By investigating the distributions of queue le...
متن کاملIntegrating Local and Global Routing on Scale-free Networks
Network navigation is one of the main problems in large communication networks. We propose a new routing strategy in which some smart nodes in networks deliver messages to next hops on the paths towards destinations according to Yan's algorithm while the other nodes just deliver messages randomly. We test our routing strategy in a large scale-free network. Simulations show that the average deli...
متن کاملEfficient and robust routing on scale-free networks
Information routing is one of the most important problems in large communication networks. In this paper we propose a novel routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates degrees of nodes in paths. Results on large scale-free networks demonstrate that our routing strategy ismore efficient than the shortest path al...
متن کاملTraffic dynamics based on local routing protocol on a scale-free network.
We propose a packet routing strategy with a tunable parameter based on the local structural information of a scale-free network. As free traffic flow on the communication networks is key to their normal and efficient functioning, we focus on the network capacity that can be measured by the critical point of phase transition from free flow to congestion. Simulations show that the maximal capacit...
متن کاملEfficient routing strategies in scale-free networks with limited bandwidth
We study the traffic dynamics in complex networks where each link is assigned a limited and identical bandwidth. Although the first-in-first-out (FIFO) queuing rule is widely applied in the routing protocol of information packets, here we argue that if we drop this rule, the overall throughput of the network can be remarkably enhanced. We propose some efficient routing strategies that do not st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 2006
ISSN: 0375-9601
DOI: 10.1016/j.physleta.2005.10.104